Description: 算法分析问题：用VC编写的旅行商程序，可以实现旅行商最短路径旅行个城市的功能-algorithm analysis : VC procedures for the preparation of the traveling salesman, TSP can achieve the shortest path of travel to the cities function Platform: |
Size: 18832 |
Author:suyulan |
Hits:
Description: 这是从其他网站下载的C#程序，用以求解旅行商的问题，采用算法为遗传算法-This is downloaded from other websites C# procedure for solving the traveling salesman problem, the algorithm used for the genetic algorithm Platform: |
Size: 3457 |
Author:刘艳 |
Hits:
Description: 使用蚁群算法解决旅行商问题，mfc应用程序，城市数目及坐标在eil51.tsp里-use ant algorithm to solve the traveling salesman problem, and mfc applications, The number of cities and coordinates the eil51.tsp Lane Platform: |
Size: 45129 |
Author:pj |
Hits:
Description: Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Platform: |
Size: 3210 |
Author:阳关 |
Hits:
Description: 遗传算法和“货郎担” 问题:
\"The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point.\" Platform: |
Size: 284142 |
Author:s050403054 |
Hits:
Description: 一个运用改良的遗传算法来解决旅行商问题的程序-an improved use of genetic algorithms to solve the traveling salesman problem procedures Platform: |
Size: 65912 |
Author:陈雷 |
Hits:
Description: 一种运用蚂蚁算法和遗传算法解决旅行商问题的混合优化程序-an ant algorithm and the use of genetic algorithms to solve the traveling salesman problem hybrid optimization procedures Platform: |
Size: 81933 |
Author:陈雷 |
Hits:
Description: 采用的是康力山等人确定的实验参数。 对于n个城市的旅行商问题，其参数如下： 初始温度：t0=280, 每一个温度下采用固定的迭代次数L=100n, 温度的衰减系数alpha=0.92 算法停止的准则是当相邻两个温度得到的解变化很小时算法停止。-used the Stanozolol Hill were determined by the experimental parameters. N cities for the traveling salesman problem, the parameters are as follows : initial temperature : t0 = 280, each a fixed temperature of the iteration number L = 100n, temperature attenuation coefficient alpha = 0.92 algorithm to stop the criteria when two adjacent the temperature change was very Solution Algorithm stop. Platform: |
Size: 2119 |
Author:谢继晖 |
Hits:
Description: 用动态规划法求解旅行商问题 已经加入注释 欢迎批评指正-dynamic programming method for the traveling salesman problem has joined Notes welcome criticism correction Platform: |
Size: 12601 |
Author:卢林 |
Hits:
Description: 一个用变形贪婪法解货郎回路的C程序代码 思想 1．选择一条最短的边作为部分解。 2．选择一条最短的且将之加入到部分解不形成回路的边。 3．重复第2步，直至所有的结点都包含在部分解中。-deformation with a greedy method for the Traveling Salesman circuit C code ideological one. Choose a minimum as part of the solution side. 2. Choose one of the shortest but to incorporate it into solutions that do not form part of the loop side. 3. Repeat Step 2 until all the nodes are included in some solution. Platform: |
Size: 13940 |
Author:莫非 |
Hits:
Description: 一个运用改良的遗传算法来解决旅行商问题的程序-an improved use of genetic algorithms to solve the traveling salesman problem procedures Platform: |
Size: 65536 |
Author:陈雷 |
Hits:
Description: 采用的是康力山等人确定的实验参数。 对于n个城市的旅行商问题，其参数如下： 初始温度：t0=280, 每一个温度下采用固定的迭代次数L=100n, 温度的衰减系数alpha=0.92 算法停止的准则是当相邻两个温度得到的解变化很小时算法停止。-used the Stanozolol Hill were determined by the experimental parameters. N cities for the traveling salesman problem, the parameters are as follows : initial temperature : t0 = 280, each a fixed temperature of the iteration number L = 100n, temperature attenuation coefficient alpha = 0.92 algorithm to stop the criteria when two adjacent the temperature change was very Solution Algorithm stop. Platform: |
Size: 2048 |
Author:谢继晖 |
Hits:
Search - the traveling salesman